Search results for "Local convergence"

On an iterative method for a class of integral equations of the first kind

1987

In this paper, we investigate an iterative method which has been proposed [1] for the numerical solution of a special class of integral equations of the first kind, where one of the essential assumptions is the positivity of the kernel and the given right-hand side. Integral equations of this special type occur in experimental physics, astronomy, medical tomography and other fields where density functions cannot be measured directly, but are related to observable functions via integral equations. In order to take into account the non-negativity of density functions, the proposed iterative scheme was defined in such a way that only non-negative solutions can be approximated. The first part o…

Interpretable Option Discovery Using Deep Q-Learning and Variational Autoencoders

2021

Deep Reinforcement Learning (RL) is unquestionably a robust framework to train autonomous agents in a wide variety of disciplines. However, traditional deep and shallow model-free RL algorithms suffer from low sample efficiency and inadequate generalization for sparse state spaces. The options framework with temporal abstractions [18] is perhaps the most promising method to solve these problems, but it still has noticeable shortcomings. It only guarantees local convergence, and it is challenging to automate initiation and termination conditions, which in practice are commonly hand-crafted.

Some supplementary results on the 1+ $$\sqrt 2 $$ order method for the solution of nonlinear equations

1982

Recently an iterative method for the solution of systems of nonlinear equations having at leastR-order 1+ $$\sqrt 2 $$ for simple roots has been investigated by the author [7]; this method uses as many function evaluations per step as the classical Newton method. In the present note we deal with several properties of the method such as monotone convergence, asymptotic inclusion of the solution and convergence in the case of multiple roots.

The convergence of the perturbed Newton method and its application for ill-conditioned problems

2011

Abstract Iterative methods, such as Newton’s, behave poorly when solving ill-conditioned problems: they become slow (first order), and decrease their accuracy. In this paper we analyze deeply and widely the convergence of a modified Newton method, which we call perturbed Newton, in order to overcome the usual disadvantages Newton’s one presents. The basic point of this method is the dependence of a parameter affording a degree of freedom that introduces regularization. Choices for that parameter are proposed. The theoretical analysis will be illustrated through examples.

On properties of the iterative maximum likelihood reconstruction method

1989

In this paper, we continue our investigations6 on the iterative maximum likelihood reconstruction method applied to a special class of integral equations of the first kind, where one of the essential assumptions is the positivity of the kernel and the given right-hand side. Equations of this type often occur in connection with the determination of density functions from measured data. There are certain relations between the directed Kullback–Leibler divergence and the iterative maximum likelihood reconstruction method some of which were already observed by other authors. Using these relations, further properties of the iterative scheme are shown and, in particular, a new short and elementar…

Iterative continuous maximum-likelihood reconstruction method

1992

Efficient High-Order Iterative Methods for Solving Nonlinear Systems and Their Application on Heat Conduction Problems

2017

[EN] For solving nonlinear systems of big size, such as those obtained by applying finite differences for approximating the solution of diffusion problem and heat conduction equations, three-step iterative methods with eighth-order local convergence are presented. The computational efficiency of the new methods is compared with those of some known ones, obtaining good conclusions, due to the particular structure of the iterative expression of the proposed methods. Numerical comparisons are made with the same existing methods, on standard nonlinear systems and a nonlinear one-dimensional heat conduction equation by transforming it in a nonlinear system by using finite differences. From these…

Some improvements of classical iterative methods for the solution of nonlinear equations

1981

On the accurate determination of nonisolated solutions of nonlinear equations

1981

A simple but efficient method to obtain accurate solutions of a system of nonlinear equations with a singular Jacobian at the solution is presented. This is achieved by enlarging the system to a higher dimensional one whose solution in question is isolated. Thus it can be computed e. g. by Newton's method, which is locally at least quadratically convergent and selfcorrecting, so that high accuracy is attainable.

Some efficient algorithms for the solution of a single nonlinear equation

1981

High order methods for the numerical solution of nonlinear scalar equations are proposed which are more efficient than known procedures, and a unified approach to various methods suggested in literature is given.